منابع مشابه
On Uniform DOL Words
We introduce the wide class of marked uniform DOL words and study their structure. The criterium of circularity of a marked uniform DOL word is given, and the subword complexity function is found for the uncircular case as well as for the circular one. The same technique is valid for a wider class of uniform DOL sequences which includes (p; 1)-Toeplitz words (see 4]).
متن کاملUnavoidable Sets of Partial Words of Uniform Length
A set X of partial words over a finite alphabet A is called unavoidable if every two-sided infinite word over A has a factor compatible with an element of X . Unlike the case of a set of words without holes, the problem of deciding whether or not a given finite set of n partial words over a k-letter alphabet is avoidable is NP-hard, even when we restrict to a set of partial words of uniform len...
متن کاملWords, words, words
‘Words, words, words.’ This was Hamlet’s reply to Polonius’ question, ‘What do you read, my lord?’ (Shakespeare, 1603) [1]. By repeating the word three times, Hamlet suggests that what he is reading is meaningless. Before launching the journal Archives of Public Health, we have asked ourselves: ‘Do we not already produce too many words too many journals?’ or in other words ‘What is the added va...
متن کامل"Words, words, words".
The aim of this paper is to call to attention a very large and important area of human factors engineering that is almost entirely neglected. This area consists of the language and the words that are attached to the tools, machines, systems, and operations with which human factors engineers are concerned. Examples, illustrations, and data are cited to show that changes in the words used in man-...
متن کاملComputing Minimum Length Representations of Sets of Words of Uniform Length
Motivated by text compression, the problem of representing sets of words of uniform length by partial words, i.e., sequences that may have some wildcard characters or holes, was recently considered and shown to be in P. Polynomial-time algorithms that construct representations were described using graph theoretical approaches. As more holes are allowed, representations shrink, and if representa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Mathematics
سال: 2004
ISSN: 0196-8858
DOI: 10.1016/s0196-8858(03)00057-5